Compositions with Pairwise Relatively Prime Summands within a Restricted Setting
نویسنده
چکیده
The paper studies the counting function R2(n, k) = ∑ a1+a2+···+ak=n (ai,aj)=1 i 6=j 1, ai ≥ 1, k ≥ 2 with ai, n and k positive integers and establishes a relationship between R2(n, k) and P2(n, k) where P2(n, k) = ∑ a1+a2+···+ak=n 1≤a1≤a2≤···≤ak≤n (ai,aj)=1 i 6=j 1, ai ≥ 1, k ≥ 2 with ai, n, k positive integers. 1. PRELIMINARIES Gould [4], studied the number-theoretic function R(n, k) = ∑ a1+a2+···+ak=n (a1,a2,··· ,ak)=1 1, ai ≥ 1, k ≥ 2 (1) and showed amongst other results that: Theorem 1: R(n, k) = ∑ d|n ( d− 1 k − 1 ) μ( n d ) and Theorem 2: ∞ ∑ j=1 R(j, k) x 1− xj = x (1− x)k . Motivated by definition 1, we now define R2(n, k) = ∑ a1+a2+···+ak=n (ai,aj)=1 i 6=j 1, ai ≥ 1, k ≥ 2. (2)
منابع مشابه
A Survey of Factorization Counting Functions
The general field of additive number theory considers questions concerning representations of a given positive integer n as a sum of other integers. In particular, partitions treat the sums as unordered combinatorial objects, and compositions treat the sums as ordered. Sometimes the sums are restricted, so that, for example, the summands are distinct, or relatively prime, or all congruent to ±1...
متن کاملThe Automorphism Group of a Product of Graphs
In a recent paper we showed that every connected graph can be written as a weak cartesian product of a family of indecomposable rooted graphs and that this decomposition is unique to within isomorphisms. Using this unique prime factorization theorem we prove that if a graph X can be written as a product of connected rooted graphs, which are pairwise relatively prime, then the automorphism group...
متن کاملA Unified Approach to Algorithms Generating Unrestricted and Restricted Integer Compositions and Integer Partitions
An original algorithm is presented that generates both restricted integer compositions and restricted integer partitions that can be constrained simultaneously by a) upper and lower bounds on the number of summands (parts) allowed, and b) upper and lower bounds on the values of those parts. The algorithm can implement each constraint individually, or no constraints to generate unrestricted se...
متن کاملSimple groups with the same prime graph as $D_n(q)$
Vasil'ev posed Problem 16.26 in [The Kourovka Notebook: Unsolved Problems in Group Theory, 16th ed.,Sobolev Inst. Math., Novosibirsk (2006).] as follows:Does there exist a positive integer $k$ such that there are no $k$ pairwise nonisomorphicnonabelian finite simple groups with the same graphs of primes? Conjecture: $k = 5$.In [Zvezdina, On nonabelian simple groups having the same prime graph a...
متن کاملCounting Rises, Levels, and Drops in Compositions
A composition of n ∈ N is an ordered collection of one or more positive integers whose sum is n. The number of summands is called the number of parts of the composition. A palindromic composition of n is a composition of n in which the summands are the same in the given or in reverse order. In this paper we study the generating function for the number of compositions (respectively, palindromic ...
متن کامل